Proving feature non-interaction with Alternating-Time Temporal Logic

نویسندگان

  • Franck Cassez
  • Mark Dermot Ryan
  • Pierre-Yves Schobbens
چکیده

Feature Interaction. When engineers design a system with features, they wish to have methods to prove that the features do not interact in ways which are undesirable. A considerable literature is devoted to this ‘feature interaction problem’ [13,5]. One approach to demonstrating that features do not interact undesirably is to equip them with properties which are intended to hold of a system having the feature [18]. In this view, a feature is a pair (F, φ) consisting of the implementation of the feature F and a set of properties φ. Integrating a feature (F, φ) with a base system S consists of modifying the base system in the way described by the feature implementation and obtaining S+F . The integration is deemed successful if the resulting system satisfies the set of properties φ corresponding to the feature. Evidence that a feature (F1, φ1) does not negatively interact with feature (F2, φ2) may be obtained by verifying that introducing F2 in S+F1, (obtaining S+F1 +F2) does not destroy the properties φ1 previous introduced by feature F1, and vice versa.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Temporal Logic Theorem Proving and its Application to the Feature Interaction Problem

We describe work in progress on a theorem prover for linear temporal logic (LTL) that will be used to automatically detect feature interactions in telecommunications systems. We build on previous work where we identified a class of LTL formulas used to specify the requirements of features, and developed a model checking tool to help find conflicts among feature requirements. The present work wi...

متن کامل

Reducing Validity in Epistemic ATL to Validity in Epistemic CTL

We propose a validity preserving translation from a subset of epistemic Alternating-time Temporal Logic (ATL) to epistemic Computation Tree Logic (CTL). The considered subset of epistemic ATL is known to have the finite model property and decidable model-checking. This entails the decidability of validity but the implied algorithm is unfeasible. Reducing the validity problem to that in a corres...

متن کامل

Action and Knowledge in Alternating-Time Temporal Logic

Alternating-time temporal logic (ATL) is a branching time temporal logic in which statements about what coalitions of agents can achieve by strategic cooperation can be expressed. Alternating-time temporal epistemic logic (ATEL) extends ATL by adding knowledge modalities, with the usual possible worlds interpretation. This paper investigates how properties of agents’ actions can be expressed in...

متن کامل

Linking Theorem Proving and Model-Checking with Well-Founded Bisimulation

We present an approach to verification that combines the strengths of model-checking and theorem proving. We use theorem proving to show a bisimulation up to stuttering on a—potentially infinite-state—system. Our characterization of stuttering bisimulation allows us to do such proofs by reasoning only about single steps of the system. We present an on-the-fly method that extracts the reachable ...

متن کامل

Linking Theorem Proving and Model - Checking

We present an approach to veriication that combines the strengths of model-checking and theorem proving. We use theorem proving to show a bisimula-tion up to stuttering on a|potentially innnite-state|system. Our characterization of stuttering bisimulation allows us to do such proofs by reasoning only about single steps of the system. We present an on-they method that extracts the reachable quot...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007